constrained optimization method meaning in Chinese
约束优化方法
Examples
- The topics covered in this course include : unconstrained optimization methods , constrained optimization methods , convex analysis , lagrangian relaxation , nondifferentiable optimization , and applications in integer programming
这门课程的主题包括：无限制最适化方法，限制最适化方法，凸分析，拉格朗日松弛法，不可微分函数最适化，以及在整数规划上的应用。 - Taking all the interval number s in the equations as optimal design variables and representing the lower and th e upper bounds of each interval number as the boundary constrain of the variable respectively , the maximum and the minimum of various components of the solution are achieved by using the constrained optimization method
将方程组中的所有区间数都作为设计变量，区间量的变化区间作为相应的设计变量的边界约束，运用约束优化法求出方程组解的各元素的最大值和最小值。 - At present , constrained optimization methods may be classified to two classes , one is search method which firstly asserts whether the current point is an optimal point , if the point is not , then we must choose search directions , and along the search direction , find the next iterative point which make the objective function or merit function to decrease
目前的约束优化算法可以分成两大类，一类是搜索算法，这种算法首先判断当前点是否为最优点，若非最优点则要确定搜索方向，然后沿此方向确定一个使目标函数或评价函数下降的点。这种算法一般为下降算法，如可行方向法、约束变尺度法等。